Whittle's index policy for a multi-class queueing system with convex holding costs

نویسندگان

  • P. S. Ansell
  • Kevin D. Glazebrook
  • José Niño-Mora
  • M. O'Keeffe
چکیده

Multi-class service systems are of increasing importance in the practical modelling world but present a significant challenge for analysis. Most results to date concerning the optimal dynamic control of such systems have assumed holding cost rates to be linear in the number of customers present. In response to arguments that such an assumption is often inappropriate, we develop an index heuristic for a multi-class M=M=1 system with increasing convex holding cost rates. We use a prescription of Whittle to develop the required indices. A numerical study elucidates very strong performance of the index policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotically optimal index policies for an abandonment queue with convex holding cost

We investigate a resource allocation problem in a multi-class server with convex holding costs and user impatience under the average cost criterion. In general, the optimal policy has a complex dependency on all the input parameters and state information. Our main contribution is to derive index policies that can serve as heuristics and are shown to give good performance. Our index policy attri...

متن کامل

Optimization of Multiclass Queueing Networks with Changeover times via the Achievable Region Approach: Part Ii, the Multi-station Case

We address the problem of scheduling a multi-station multiclass queueing network (MQNET) with server changeover times to minimize steady-state mean job holding costs. We present new lower bounds on the best achievable cost that emerge as the values of mathematical programming problems (linear, semidefinite, and convex) over relaxed formulations of the system’s achievable performance region. The...

متن کامل

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclass queueing network (MQNET) with server changeover times to minimize steady-state mean job holding costs. We present new lower bounds on the best achievable cost that emerge as the values of mathematical programming problems (linear, semide nite, and convex) over relaxed formulations of the system's achievable performance region. The ...

متن کامل

The cμ/θ rule for many-server queues with abandonment

We consider a multi-class queueing system with multiple homogeneous servers and customer abandonment. For each customer class i, the holding cost per unit time, the service rate and the abandonment rate are denoted by ci, μi and θi, respectively. We prove that under a many-server fluid scaling and overload conditions, a routing policy that assigns priority to classes according to their index ci...

متن کامل

Optimal pricing for a GI/M/k/N queue with several customer types and holding costs

This paper studies optimal pricing for a GI/M/k/N queueing system with several types of customers. An arrival joins the queue, if the price of service is not higher than the maximum amount that the arrival is willing to pay, and this maximum amount is defined by the customer type. A system manager chooses a price depending on the number of customers in the system. In addition, the system incurs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2003